CTIDH: faster constant-time CSIDH
نویسندگان
چکیده
This paper introduces a new key space for CSIDH and algorithm constant-time evaluation of the group action. The is not useful with previous algorithms, spaces, but combining produces speed records CSIDH. For example, CSIDH-512 256-bit space, best results used 789000 multiplications more than 200 million Skylake cycles; this uses 438006 125.53 cycles.
منابع مشابه
Faster Small-Constant-Periodic Merging Networks
We consider the problem of merging two sorted sequences on a comparator network that is used repeatedly, that is, if the output is not sorted, the network is applied again using the output as input. The challenging task is to construct such networks of small depth (called a period in this context). In our previous paper Faster 3-Periodic Merging Network we reduced twice the time of merging on 3...
متن کاملConstant H field, cosmology and faster than light solitons
We analyze the possibility of having a constant spatial NS-NS field, H123. Cosmologically, it will act as stiff matter, and there will be very tight constraints on the possible value of H123 today. However, it will give a noncommutative structure with an associative star product of the type θ = αǫx. This will be a fuzzy space with constant radius slices being fuzzy spheres. We find that gauge t...
متن کاملFaster Algorithms for Quantitative Verification in Constant Treewidth Graphs
We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff property, the ratio property, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of th...
متن کاملFaster than Hermitian Time Evolution
For any pair of quantum states, an initial state |I〉 and a final quantum state |F 〉, in a Hilbert space, there are many Hamiltonians H under which |I〉 evolves into |F 〉. Let us impose the constraint that the difference between the largest and smallest eigenvalues of H, Emax and Emin, is held fixed. We can then determine the Hamiltonian H that satisfies this constraint and achieves the transform...
متن کاملVerifying Constant-Time Implementations
The constant-time programming discipline is an effective countermeasure against timing attacks, which can lead to complete breaks of otherwise secure systems. However, adhering to constant-time programming is hard on its own, and extremely hard under additional efficiency and legacy constraints. This makes automated verification of constant-time code an essential component for building secure s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IACR transactions on cryptographic hardware and embedded systems
سال: 2021
ISSN: ['2569-2925']
DOI: https://doi.org/10.46586/tches.v2021.i4.351-387